Characterizing Arithmetic Circuit Classes by Constraint Satisfaction Problems
نویسنده
چکیده
We explore the expressivity of constraint satisfaction problems (CSPs) in the arithmetic circuit model. While CSPs are known to yield VNP-complete polynomials in the general case, we show that for different restrictions of the structure of the CSPs we get characterizations of different arithmetic circuit classes. In particular we give the first natural non-circuit characterization of VP, the class of polynomial families efficiently computable by arithmetic circuits.
منابع مشابه
Characterizing Arithmetic Circuit Classes by Constraint Satisfaction Problems - (Extended Abstract)
We explore the expressivity of constraint satisfaction problems (CSPs) in the arithmetic circuit model. While CSPs are known to yield VNP-complete polynomials in the general case, we show that for different restrictions of the structure of the CSPs we get characterizations of different arithmetic circuit classes. In particular we give the first natural non-circuit characterization of VP, the cl...
متن کاملConstraint Satisfaction Problems around Skolem Arithmetic
We study interactions between Skolem Arithmetic and certain classes of Constraint Satisfaction Problems (CSPs). We revisit results of Glaßer et al. [17] in the context of CSPs and settle the major open question from that paper, finding a certain satisfaction problem on circuits to be decidable. This we prove using the decidability of Skolem Arithmetic. We continue by studying first-order expans...
متن کاملSecure Multi-party Computation for selecting a solution according to a uniform distribution over all solutions of a general combinatorial problem
Secure simulations of arithmetic circuit and boolean circuit evaluations are known to save privacy while providing solutions to any probabilistic function over a field. The problem we want to solve is to select a random solution of a general combinatorial problem. Here we discuss how to specify the need of selecting a random solution of a general combinatorial problem, as a probabilistic functi...
متن کاملLifting Techniques for Weighted Constraint Satisfaction Problems
In this paper, we identify rich tractable classes of Weighted Constraint Satisfaction Problems (WCSPs). Our results stem from employing a set of transformation techniques—referred to as “Lifting”—that considers each constraint locally. We show that, in general, WCSPs are reducible to minimum weighted vertex cover problems in tripartite graphs; and many tractable classes of WCSPs can be recogniz...
متن کاملSecure Combinatorial Optimization Simulating DFS Tree-Based Variable Elimination
In general, Constraint Optimization Problems (COP) are NP-hard. Using variable elimination techniques [5, 13] COPs can be solved with computation that is exponential only in the induced-width of the constraint graph (given some order on the nodes), i.e. smaller than n. Orders on nodes allowing for some parallelism are offered by Depth First Search (DFS) trees of the constraint graph [3, 13]. An...
متن کامل